Bin Packing Problem with Uncertain Volumes and Capacities
نویسندگان
چکیده
Bin packing problem is a traditional problem in combinatorial optimization and applied widely in modern society. This paper presents bin packing problem with uncertain volumes and capacities. First, two types of uncertain programming models are mathematically constructed for the uncertain bin packing problem, including expected value model and chance-constrained programming model. Next, the proposed models can be transformed into the corresponding deterministic forms by taking advantage of uncertainty theory. Finally, a numerical experiment is presented to show the performances of the proposed models and algorithms.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملA Linear Approximation Algorithm for 2-Dimensional Vector Packing
We study the 2-dimensional vector packing problem, which is a generalization of the classical bin packing problem where each item has 2 distinct weights and each bin has 2 corresponding capacities. The goal is to group items into minimum number of bins, without violating the bin capacity constraints. We propose an Θ(n)-time approximation algorithm that is inspired by the O(n) algorithm proposed...
متن کاملMulti-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting jobs; the processing node. A job was allocated the minimum number of nodes required to meet its largest resource requirement (e.g. memory, CPUs, I/O channels, etc.). Single capacity bin-packing algorithms were applied to ...
متن کاملEfficient Heuristics for the Variable Size Bin Packing Problem with Fixed Costs
We consider the Variable Size Bin Packing Problem with Fixed Costs, a generalization of the well-known bin packing problem where a set of items must be packed within a set of heterogeneous bins characterized by possibly different volumes and fixed costs. The objective of the problem is to select the bins to pack all items while minimizing the total cost incurred for the selected bins. We presen...
متن کاملEfficient lower bounds and heuristics for the variable cost and size bin packing problem
We consider the Variable Cost and Size Bin Packing Problem, a generalization of the well-known bin packing problem, where a set of items must be packed into a set of heterogeneous bins characterized by possibly different volumes and fixed selection costs. The objective of the problem is to select bins to pack all items at minimum total binselection cost. The paper introduces lower bounds and he...
متن کامل